Complete theory

Results: 1780



#Item
131Graph theory / Mathematics / NP-complete problems / Degree / Algebraic graph theory / Covering graph / Line graph

Spectral Graph Theory and Applications WSLecture 7: Hitting Time and Cover Time of Random Walks Lecturer: Thomas Sauerwald & He Sun

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2011-12-08 09:45:37
132Graph theory / Mathematics / NP-complete problems / Matroid theory / Steiner tree problem / Bipartite graph / Eulerian path / Graph / Degree / Ear decomposition / Directed graph / Cycle

CS261: Exercise Set #7 For the week of February 15–19, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza.

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-02-18 01:28:39
133Algebra / Linear algebra / Mathematics / Matrix theory / Structure from motion / Matrix / Singular value decomposition / Inverse problem / Eigenvalues and eigenvectors / Rigid motion segmentation / TomasiKanade factorization

COMPLETE 3-D MODELS FROM VIDEO: A GLOBAL APPROACH Bruno B. Gonc¸alves and Pedro M. Q. Aguiar Institute for Systems and Robotics, Instituto Superior T´ecnico, Lisboa, Portugal E-mail: ,

Add to Reading List

Source URL: users.isr.ist.utl.pt

Language: English - Date: 2004-06-15 07:04:43
134Graph theory / NP-complete problems / Pathwidth / Clique problem

MCS 401 – Computer Algorithms I Spring 2016 Problem Set 4 Lev Reyzin Due: by the beginning of class

Add to Reading List

Source URL: homepages.math.uic.edu

Language: English - Date: 2016-03-11 11:13:37
135Topology / Mathematics / General topology / Space / Topological spaces / Metric geometry / Separation axioms / Hausdorff space / Metric space / Limit of a function / Closed set / Complete metric space

MSM3P22/MSM4P22 Further Complex Variable Theory & General Topology Course notes - Handout 5 Jos´e A. Ca˜ nizo October 16, 2012

Add to Reading List

Source URL: canizo.org

Language: English - Date: 2015-01-23 17:42:01
136Computational complexity theory / Theory of computation / Mathematics / NP-complete problems / Set cover problem / NP / Dominating set / Approximation algorithm / Metric k-center / Optimization problem / Reduction / P versus NP problem

Approximability Results for the p-Center Problem Stefan Buettcher Course Project Algorithm Design and Analysis

Add to Reading List

Source URL: stefan.buettcher.org

Language: English - Date: 2004-09-19 21:38:52
137Computational complexity theory / Complexity classes / Theory of computation / PPAD / Reduction / LemkeHowson algorithm / Algorithm / NP / PSPACE-complete / P / True quantified Boolean formula

The Complexity of Computing the Solution Obtained by a Specific Algorithm Paul W. Goldberg Department of Computer Science University of Oxford, U. K.

Add to Reading List

Source URL: www.maths.lse.ac.uk

Language: English - Date: 2013-10-30 13:41:09
138Chess / Visual arts / Publishing / Graphic design / Paper art / Book design / Chess theory / Paul Morphy / Bookbinding / Gambit / Fred Reinfeld / Computer chess

GM Square Auction No. 15, 23-25 March 2006 Chess Magazines Lot 1. The Chess Player. Volumes 1-4 – a complete run. Weekly British chess magazine, edited by Kling and Horwitz, published from 19 JulyContents: chess

Add to Reading List

Source URL: www.gmsquare.com

Language: English - Date: 2015-06-03 23:26:51
139Mathematics / Computational complexity theory / Applied mathematics / NP-complete problems / Combinatorial optimization / Operations research / Mathematical optimization / Machine learning / Algorithm / Greedy algorithm / Heuristic / Knapsack problem

arXiv:1511.07147v1 [cs.LG] 23 NovA PAC Approach to Application-Specific Algorithm Selection∗ Rishi Gupta Tim Roughgarden

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2015-11-23 20:51:24
140Mathematics / Computational complexity theory / Geometry / Polygons / NP-complete problems / Euclidean plane geometry / Art gallery problem / Computational geometry / Vertex / APX

Maximizing the Guarded Boundary of an Art Gallery is APX-complete Euripides Markou1, Stathis Zachos1,2 and Christodoulos Fragoudakis1 1 Computer Science, ECE, National Technical University of Athens

Add to Reading List

Source URL: emarkou.users.uth.gr

Language: English - Date: 2016-05-24 11:28:43
UPDATE